Arrow's Theorem with a fixed feasible alternative

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arrow ' s Theorem with a Fixed Feasible Alternative *

Arrow's Theorem, in its social choice function formulation, assumes that all nonempty finite subsets of the universal set of alternatives is potentially a feasible set. We demonstrate that the axioms in Arrow's Theorem, with weak Pareto strengthened to strong Pareto, are consistent if it is assumed that there is a prespecified alternative which is in every feasible set. We further show that if ...

متن کامل

Dice games and Arrows theorem

We observe that non-transitivity is not the most general way that Arrow’s impossibility theorem is re‡ected in dice games. Non-transitivity in dice games is a well-known phenomenon. It was described in several Scienti…c American columns in the 1970s, beginning with [3], and has since become a popular topic, discussed in articles like [4, 5] and textbooks on elementary mathematics and probabilit...

متن کامل

Vector ultrametric spaces and a fixed point theorem for correspondences

In this paper, vector ultrametric spaces are introduced and a fixed point theorem is given for correspondences. Our main result generalizes a known theorem in ordinary ultrametric spaces.

متن کامل

A RELATED FIXED POINT THEOREM IN n FUZZY METRIC SPACES

We prove a related fixed point theorem for n mappings which arenot necessarily continuous in n fuzzy metric spaces using an implicit relationone of them is a sequentially compact fuzzy metric space which generalizeresults of Aliouche, et al. [2], Rao et al. [14] and [15].

متن کامل

A Common Fixed Point Theorem Using an Iterative Method

Let $ H$ be a Hilbert space and $C$ be a closed, convex and nonempty subset of $H$. Let $T:C rightarrow H$ be a non-self and non-expansive mapping. V. Colao and G. Marino with particular choice of the sequence  ${alpha_{n}}$ in Krasonselskii-Mann algorithm, ${x}_{n+1}={alpha}_{n}{x}_{n}+(1-{alpha}_{n})T({x}_{n}),$ proved both weak and strong converging results. In this paper, we generalize thei...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Social Choice and Welfare

سال: 1987

ISSN: 0176-1714,1432-217X

DOI: 10.1007/bf00450993